Mixed Matrices — Irreducibility and Decomposition — ∗
نویسنده
چکیده
This paper surveys mathematical properties of (layered-) mixed matrices with emphasis on irreducibility and block-triangular decomposition. A matrix A is a mixed matrix if A = Q + T , where Q is a “constant” matrix and T is a “generic” matrix (or formal incidence matrix) in the sense that the nonzero entries of T are algebraically independent parameters. A layered mixed (or LM-) matrix is a mixed matrix such that Q and T have disjoint nonzero rows, i.e., no row of A = Q + T has both a nonzero entry from Q and a nonzero entry from T . The irreducibility for an LM-matrix is defined with respect to a natural admissible transformation as an extension of the well-known concept of full indecomposability for a generic matrix. Major results for fully indecomposable generic matrices such as Frobenius’ characterization in terms of the irreducibility of determinant are generalized. As for block-triangularization, the Dulmage-Mendelsohn decomposition is generalized to the combinatorial canonical form (CCF) of an LM-matrix along with the uniqueness and the algorithm. Matroid-theoretic methods are useful for investigating a mixed matrix. ∗Combinatorial and Graph-Theoretic Problems in Linear Algebra (eds.: R. A. Brualdi, S. Friedland and V. Klee), The IMA Volumes in Mathematics and Its Applications, Vol. 50, Springer, 1993, pp.39– 71. See also: K. Murota: Matrices and Matroids for Systems Analysis, Algorithms and Combinatorics, Vol.20, Springer-Verlag, 2000 (ISBN=3-54066-024-0). †Department of Mathematical Informatics, Graduate School of Information Science and Technology University of Tokyo, Tokyo 113-8656, Japan.
منابع مشابه
On the decomposition of differential behaviors into the direct sum of irreducible components
In a recent pair of contributions [2, 3], starting from a set of results about the relationship between the direct sum decomposition of (linear, time-invariant, differential) behaviors and the solvability of certain two-sided Bézout equations, it was shown that every autonomous behavior can be expressed as a direct sum of irreducible components. In this contribution, we further explore this iss...
متن کاملCartesian decomposition of matrices and some norm inequalities
Let X be an n-square complex matrix with the Cartesian decomposition X = A + i B, where A and B are n times n Hermitian matrices. It is known that $Vert X Vert_p^2 leq 2(Vert A Vert_p^2 + Vert B Vert_p^2)$, where $p geq 2$ and $Vert . Vert_p$ is the Schatten p-norm. In this paper, this inequality and some of its improvements ...
متن کاملSymbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملEla Schur Complements of Generally Diagonally Dominant Matrices and a Criterion for Irreducibility of Matrices∗
As is well known, the Schur complements of strictly or irreducibly diagonally dominant matrices are H−matrices; however, the same is not true of generally diagonally dominant matrices. This paper proposes some conditions on the generally diagonally dominant matrix A and the subset α ⊂ {1, 2, . . . , n} so that the Schur complement matrix A/α is an H−matrix. These conditions are then applied to ...
متن کاملIrreducibility is Minimum Synergy Among Parts
For readers already familiar with Partial Information Decomposition (PID), we show that PID’s definition of synergy enables quantifying at least four different notions of irreducibility. First, we show four common notions of “parts” give rise to a spectrum of four distinct measures of irreducibility. Second, we introduce a nonnegative expression based on PID for each notion of irreducibility. T...
متن کامل